Execution cost interval refinement in static software analysis
نویسندگان
چکیده
Embedded system software timing and power consumption or, in general, execution costs are state and input data dependent. Therefore, formal analysis of such dependencies leads to execution cost intervals rather than single values. These intervals depend on system concurrency, execution paths and process states, as well as on target architecture properties. This paper presents an approach to modeling and analysis of process behavior using intervals. Unlike other static software analysis approaches, it considers program properties and the execution context, i.e. the current state and input of a process. The example of an ATM switch component demonstrates significant improvements in analysis precision. Keywords— Software Timing Analysis, Real-Time Systems, Embedded System Design, Design Automation
منابع مشابه
Counterexample Guided Path Reduction for Static Program Analysis
In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce the number of false positives by reducing the number of feasible paths in the abstraction iteratively. Given a counterexample, a set of observers is computed which exclude infeasible paths in the next iteration. This approach com...
متن کاملSimulation of Store Separation using Low-cost CFD with Dynamic Meshing
The simulation of the store separation using the automatic coupling of dynamic equations with flow aerodynamics is addressed. The precision and cost (calculation time) were considered as comparators. The method used in the present research decreased the calculation cost while limiting the solution error within a specific and tolerable interval. The methods applied to model the aerodynamic force...
متن کاملIncremental False Path Elimination for Static Software Analysis
In this work we introduce a novel approach for removing false positives in static program analysis. We present an incremental algorithm that investigates paths to failure locations with respect to feasibility. The feasibility test it done by interval constraint solving over a semantic abstraction of program paths. Sets of infeasible paths can be ruled out by enriching the analysis incrementally...
متن کاملDynamic Symbolic Execution using Eclipse CDT
Finding software bugs before deployment is essential to achieve software safety and security. The achievable code coverage and input coverage with manual test suite development at reasonable cost is limited. Therefore, complementary automated methods for bug detection are of interest. This paper describes automated context-sensitive detection of software bugs with dynamic symbolic execution. Th...
متن کاملOptimizing the Symbolic Execution of Communicating and Evolving State Machines
This paper describes research investigating two complementary optimization techniques that leverage the similarities between state machines versions to reduce the cost of symbolic execution of the evolved version. I. RESEARCH PROBLEM AND MOTIVATION Model Driven Engineering (MDE) is a model-centric software engineering approach that aims at improving the productivity and the quality of software ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Systems Architecture
دوره 47 شماره
صفحات -
تاریخ انتشار 2001